Some ‘complexity’ issues for ill-posed problems
نویسنده
چکیده
A ‘correct’ interpretation of the computational complexity of an ill-posed problem is formulated as a cost/effectiveness balance for the use of available data to obtain adequate solutions for an application. This composition with an application, is seen as the real problem, leading to the conclusion that some apparently ill-posed problems are, in context, really well-posed with a reasonable associated ‘compositional complexity’.
منابع مشابه
Ill-Posed and Linear Inverse Problems
In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.
متن کاملComplexity of linear ill-posed problems in Hilbert space
Information complexity of ill-posed problems may be seen as controversial. On the one hand side there were pessimistic results stating that the complexity is in nite, while on the other hand side the theory of ill-posed problems is well developed. In contrast to well-posed problems (continuous solution operators) the complexity analysis of ill-posed problems (discontinuous solution operators) i...
متن کاملLocal Annihilation Method and Some Stiff Problems
In this article, a new scheme inspired from collocation method is presented for numerical solution of stiff initial-value problems and Fredholm integral equations of the first kind based on the derivatives of residual function. Then, the error analysis of this method is investigated by presenting an error bound. Numerical comparisons indicate that the presented method yields accur...
متن کاملNumerical Solution of a Free Boundary Problem from Heat Transfer by the Second Kind Chebyshev Wavelets
In this paper we reduce a free boundary problem from heat transfer to a weakly Singular Volterra integral equation of the first kind. Since the first kind integral equation is ill posed, and an appropriate method for such ill posed problems is based on wavelets, then we apply the Chebyshev wavelets to solve the integral equation. Numerical implementation of the method is illustrated by two ben...
متن کاملReducing the Time Complexity and Identifying Ill-posed Problem Instances of Minkowski Sum Based Similarity calculations
To calculate the Minkowski-sum based similarity measure of two convex polyhedra, many relative orientations have to be considered. These relative orientations are characterized by the fact that some faces and edges of the polyhedra are parallel. For every relative orientation of the polyhedra, the volume or mixed volume of their Minkowski sum is evaluated. From the minimum of this volume, the s...
متن کامل